Asymptotically almost all \lambda-terms are strongly normalizing
نویسندگان
چکیده
We present quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators) the result is exactly opposite. We show that almost all terms are not strongly normalizing. This due to the fact that any fixed combinator almost always appears in a random combinator.
منابع مشابه
Asymptotically almost all λ - terms are strongly normalizing ∗
We present a quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results show that asymptotically, almost all terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators), the result is exactly opposite. We show that almos...
متن کاملSome properties of random λ-terms∗
We present quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators) the result is exactly opposite. We show that almost all te...
متن کامل3 1 M ar 2 00 9 Some properties of random λ - terms
We show various (syntactic and behavioral) properties of random λ-terms. Our main results are that at least 3/4 of the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators) the result is different. We show that almost all terms are not strongly normalizing, beca...
متن کاملA Natural Counting of Lambda Terms
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn indices in a very natural model where all the operators have size 1. For plain lambda terms, the sequence corresponds to two families of binary trees for which we exhibit bijections. We study also the distribution of normal forms, head normal forms and strongly n...
متن کاملCharacterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types
An intersection type assignment system for the extension ΛJ of the untyped λ-calculus, introduced by Joachimski and Matthes, is given and proven to characterize the strongly normalizing terms of ΛJ. Since ΛJ’s generalized applications naturally allow permutative/commuting conversions, this is the first analysis of a term rewrite system with permutative conversions by help of intersection types....
متن کامل